A discrete-time queueing system with three different strategies

We consider a discrete-time G e o / 1 ∞ system in which customer that finishes its first essential service may opt to abandon the system, receive second optional or go at head of queue order another service. study Markov chain underlying considered queueing and ergodicity condition. Using generating function approach distribution number customers as well their respective means are given. The busy period an auxiliary will be useful delay, is analysed. distributions sojourn time server, provided. In illustrate effect parameters on several performance characteristics some numerical examples Finally, section conclusions commenting main research contributions this paper presented.